The Plant Location Problem: New Models and Research Prospects
نویسندگان
چکیده
منابع مشابه
New DEA/Location Models with Interval Data
Recently the concept of facility efficiency, which defined by data envelopment analysis (DEA), introduced as a location modeling objective, that provides facilities location’s effect on their performance in serving demands. By combining the DEA models with the location problem, two types of “efficiencies” are optimized: spatial efficiency which measured by finding the least cost location and al...
متن کاملEasy Instances Of The Plant Location Problem
In this paper we describe properties of a particular transformation of the simple plant location problem into a vertex packing problem on a corresponding undirected graph. We characterize the undirected graphs that arise from simple plant location problems and we give a necessary and su cient condition for such graphs to be perfect. This allows us to nd a new family of polynomially solvable ins...
متن کاملNew stochastic models for capacitated location-allocation problem
Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Fina...
متن کاملThe Genetic heuristics for the Plant and Warehouse Location Problem
We studied a logistics network design model composed of plants, warehouses and customers. For designing this integrated model, we had to make two decisions simultaneously; the location of plants and warehouses, and the product distribution from plants to customers through warehouses. We provided a heuristic using the genetic algorithm. The chromosome presents the location of plants and the allo...
متن کاملBranch and peg algorithms for the simple plant location problem
The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve these problems. In this paper we present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1996
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.44.6.864